Adaptive Mapping of Linear DSP Algorithms to Fixed-Point Arithmetic
نویسندگان
چکیده
Introduction Embedded DSP (digital signal processing) applications are typically implemented using fixed point arithmetic; in hardware to reduce area requirements and increase throughput, but also in software since most embedded processors do not provide floating point arithmetic. Consequently, the developer is confronted with the difficult task of deciding on the fixed point format, i.e., the number of integer and fractional bits to avoid overflow and ensure sufficient accuracy. For software implementations, the entire bitwidth is fixed, typically at 32, which means that increasing the representable range (number of integer bits) reduces the available accuracy (number of fractional bits) and vice-versa. In this paper we present a compiler that translates a floating point C implementation of a linear DSP kernel, such as a discrete Fourier or wavelet transform, into a high accuracy fixed point C implementation. The inputs to the compiler are a floating point arithmetic C program and the range of the input vector elements. First, the compiler statically analyzes the program in a single pass using a recently developed tool that uses affine arithmetic modeling [1]. Then, in the global mode, the compiler determines the global fixed point format with the least number of integer bits (and thus the highest accuracy) that guarantees to avoid overflow and outputs the corresponding code. More interesting is the local mode, in which the compiler determines the best format independently for each variable, thus further pushing the possible accuracy. The compiler is currently limited to straightline code; an extension to loop code is in development. Further, we used the SPIRAL code generator [2] to generate numerically robust implementations as input to our compiler, thus automating the entire design flow of creating high accuracy fixed point implementations for linear DSP kernels. Experiments with different transforms show that by choosing the formats independently (local mode) the accuracy can be improved by a factor of up to 5 in terms of a norm-based error measure.
منابع مشابه
Design and Implementation of Numerical Linear Algebra Algorithms on Fixed Point DSPs
Numerical linear algebra algorithms use the inherent elegance of matrix formulations and are usually implemented using C/C++ floating point representation. The system implementation is faced with practical constraints because these algorithms usually need to run in real time on fixed point digital signal processors (DSPs) to reduce total hardware costs. Converting the simulation model to fixed ...
متن کاملSQNR Estimation of Fixed-Point DSP Algorithms
A fast and accurate quantization noise estimator aiming at fixed-point implementations of Digital Signal Processing (DSP) algorithms is presented. The estimator enables significant reduction in the computation time required to perform complex wordlength optimizations. The proposed estimator is based on the use of Affine Arithmetic (AA) and it is presented in two versions: (i) a general version ...
متن کاملFeasibility of Fixed-Point Transversal Adaptive Filters in FPGA Devices with Embedded DSP Blocks
Transversal adaptive filters for digital signal processing have traditionally been implemented into DSP processors due to their ability to perform fast floating-point arithmetic. However, with its growing die size as well as incorporating the embedded DSP block, the FPGA devices have become a serious contender in the signal processing market. Although it is not yet feasible to use floating-poin...
متن کاملEfficient Static Analysis of Fixed-Point Error in DSP Applications via Affine Arithmetic Modeling
Translating digital signal processing (DSP) software into its finite-precision hardware implementation is often a timeconsuming task. We describe a new static analysis technique that can accurately analyze finite-precision effects arising from fixed-point implementations of DSP algorithms. The technique is based on recent interval representation methods from affine arithmetic, and the use of ne...
متن کاملA Family of Recursive Least-squares Adaptive Algorithms Suitable for Fixed-point Implementation
The main feature of the least-squares adaptive algorithms is their high convergence rate. Unfortunately, they encounter numerical problems in finite precision implementation and especially in fixed-point arithmetic. The objective of this paper is twofold. First, an analysis of the finite precision effects of the recursive least-squares (RLS) algorithm is performed, outlining some specific probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004